//
// Created by Tiany on 2021/6/22.
//二叉树的顺序表示方式

#ifndef SHUJUJIEGOU_SEQBINTREE_H
#define SHUJUJIEGOU_SEQBINTREE_H

//数据结构
struct DataType{
    int n
};

//二叉树的结构1-顺序存储
struct SeqBinTree{
    int MAXNUM;
    int n;
    struct DataType *nodelist;
};
typedef struct SeqBinTree *PSeqBinTree;

//二叉树的创建
PSeqBinTree createEmptyBinTree_seq(int m);

//返回下标为p的结点的父结点的下标
int parent_seq(PSeqBinTree tree,int p);

//返回下标为p的结点的左子结点的下标
int leftChild_seq(PSeqBinTree tree,int p);

//返回下标为p的结点的右子结点的下标
int rightChild_seq(PSeqBinTree tree,int p);

///
///
///
///
///
//
#endif //SHUJUJIEGOU_SEQBINTREE_H
